package leetcode.D400.T347;

import util.ListUtil;

public class M347 {
    public static void main(String[] args) {
        int[] nums = ListUtil.parseIntArray("[1,1,1,2,2,3]");
        int k = 2;
        int[] result = new Solution().topKFrequent(nums, k);
        for (int x : result) {
            System.out.print(x + " ");
        }
        System.out.println();
    }
}
